Going Far, Logically
نویسندگان
چکیده
There are numerous applications where we need to ensure that multiple moving objects are sufficiently far apart. Furthermore, in many moving object domains, there is positional indeterminacy — we are not 100% sure exactly when a given moving object will be at a given location. [Yaman et al., 2004] provided a logic of motion but did not provide algorithms to ensure that moving objects are kept sufficiently far apart. In this paper, we extend their logic to include a “far” predicate. We develop the CheckFar algorithm that checks if any given two objects will always be sufficiently far apart at during a time interval. We have run a set of experiments showing that our CheckFar algorithm scales very well.
منابع مشابه
Lexicographic Closure for Defeasible Description Logics
In the field of non-monotonic logics, the lexicographic closure is acknowledged as a a powerful and logically well-characterized approach; we are going to see that such a construction can be applied in the field of Description Logics, an important knowledge representation formalism, and we shall provide a simple decision procedure.
متن کاملForms and Methods of Teaching in Higher Education Institutions
The lecture is a creative process in which both a lecturer and a student take part. The basic aim of the lecture is to help students to comprehend the major notions of the subject taught which implies creative and active perception of the material. In addition, attention should be paid to basic concepts, definitions, designations, assumptions. A critical analysis of main issues, facts and ideas...
متن کاملEnforcing Logically Weaker Knowledge in Classical Logic
This paper is concerned with a fundamental issue in knowledge representation and reasoning that, surprisingly, has received little attention so far. The point is that inserting some logically weaker (but, in a sense, more precise) information within a logic-based representation is not a straightforward process if the extra information must prevail. Indeed, it does neither prevail by itself nor ...
متن کاملOntogeny and Phylogenetic Systematics
Dedifferentiation, paedomorphosis, and the insertion and deletion of developmental stages make it impossible to deduce the genealogical hierarchy frum only ontogenetic transformation series. Like the outgroup criterion, ontogenetic character precedence is not theory-neutral and to use it to deduce genealogy requires certain assumptions. If scientists are going to use logically unbeatable theori...
متن کاملNondegenerate 2-State 3-Symbol Reversible Logic Elements Are All Universal
In the investigation of minimal machinery in reversible computing, we proved that each nondegenerate 2-state 3-symbol reversible logic element is logically universal. So far, a 2-state 4-symbol element called “rotary element” was shown to be logically universal in the framework of reversible logic element with memory. The main result in this paper not only improves the previous result with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005